Continuation Models Are Universal for -calculus

نویسنده

  • Martin Hofmann
چکیده

We show that a certain simple call-by-name continuation semantics of Parigot's-calculus is complete. More precisely, for every-theory we construct a cartesian closed category such that the ensuing continuation-style interpretation of , which maps terms to functions sending abstract continuations to responses , is full and faithful. Thus, any-category in the sense of is isomorphic to a continuation model 4] derived from a cartesian-closed category of continuations.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Classical logic, continuation semantics and abstract machines

One of the goals of this paper is to demonstrate that denotational semantics is useful for operational issues like implementation of functional languages by abstract machines. This is exemplified in a tutorial way by studying the case of extensional untyped call-byname λ-calculus with Felleisen’s control operator C. We derive the transition rules for an abstract machine from a continuation sema...

متن کامل

Classical Logic, Continuation Semantics and Abstract Machines

One of the goals of this paper is to demonstrate that denotational semantics is useful for operational issues like implementation of functional languages by abstract machines. This is exempliied in a tutorial way by studying the case of extensional untyped call-by-name-calculus with Felleisen's control operator C. We derive the transition rules for an abstract machine from a continuation semant...

متن کامل

Continuation-passing Style Models Complete for Intuitionistic Logic

A class of models is presented, in the form of continuation monads polymorphic for first-order individuals, that is sound and complete for minimal intuitionistic predicate logic. The proofs of soundness and completeness are constructive and the computational content of their composition is, in particular, a β-normalisation-by-evaluation program for simply typed lambda calculus with sum types. A...

متن کامل

Sound and Complete Axiomatisations of Call-by-Value Control Operators

We formulate a typed version of call-by-value-calculus containing variants of Felleisen's control operators A and C which provide explicit access to continuations and logically extend the propositions-as-types correspondence to classical propositional logic. We give an equational theory for this calculus which is shown to be sound and complete with respect to to a class of categorical models ba...

متن کامل

Rational Choice Theory: A Cultural Reconsideration

Economists have heralded the formulation of the expected utility theorem as a universal method of choice under uncertainty. In their seminal paper, Stigler and Becker (Stigler & Becker, 1977) declared that “human behavior can be explained by a generalized calculus of utility-maximizing behavior” (p.76). The universality of the rational choice theory has been widely criticized by psychologists, ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2008